A Framework to Minimize Total Energy Consumption and Total Tardiness on a Single Machine
نویسندگان
چکیده
A great amount of energy is wasted in industry by machines that remain idle due to underutilization. A way to avoid wasting energy and thus reducing the carbon print of an industrial plant is to consider minimization of energy consumption objective while making scheduling decisions. In order to minimize energy consumption, the decision maker has to decide the timing and length of turn off /turn on operation (a setup) and also provide a sequence of jobs that minimizes the scheduling objective, assuming that all jobs are not available at the same time. In this paper, a framework to solve a multiobjective optimization problem that minimizes total energy consumption and total tardiness is proposed. Since total tardiness problem with release dates is an NP-hard problem, a new greedy randomized multiobjective adaptive search metaheuristic (GRASPTETT) is utilized to obtain an approximate pareto front (i.e., an approximate set of non-dominated solutions). Analytic Hierarchical Process is utilized to determine the ”best” alternative among the solutions on the pareto front. The proposed framework is illustrated on a case study. It is shown that a wide variety of dispersed solutions can be obtained via the proposed framework, and as total tardiness decreases, total energy consumption increases.
منابع مشابه
An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملMinimizing the energy consumption and the total weighted tardiness for the flexible flowshop using NSGA-II and NRGA
This paper presents a bi-objective MIP model for the flexible flow shop scheduling problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008